GPU-accelerated Hausdorff distance computation between dynamic deformable NURBS surfaces

نویسندگان

  • Adarsh Krishnamurthy
  • Sara McMains
  • Iddo Hanniel
چکیده

We present a parallel GPU-accelerated algorithm for computing the directed Hausdorff distance from one NURBS surface to another, within a bound. We make use of axis-aligned bounding-box hierarchies that bound the NURBS surfaces to accelerate the computations. We dynamically construct as well as traverse the bounding-box hierarchies for the NURBS surfaces using operations that are optimized for the GPU. To compute the Hausdorff distance, we traverse this hierarchy after culling bounding-box pairs that do not contribute to the Hausdorff distance. Our contribution includes two-sided culling tests that can be performed in parallel using the GPU. The culling, based on the minimum and maximum distance ranges between the bounding boxes, eliminates boundingbox pairs from both surfaces that do not contribute to the Hausdorff distance simultaneously. We calculate accuracy bounds for our computed Hausdorff distance based on the curvature of the surfaces. Our algorithm runs in real-time with very small guaranteed error bounds for complex NURBS surfaces. Since we dynamically construct our bounding-box hierarchy, our algorithm can be used to interactively compute the Hausdorff distance for models made of dynamic deformable surfaces.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

GPU-based Collision Detection for Deformable Parameterized Surfaces

Based on the potential of current programmable GPUs, recently several approaches were developed that use the GPU to calculate deformations of surfaces like the folding of cloth or to convert higher level geometry to renderable primitives like NURBS or subdivision surfaces. These algorithms are realized as a per-frame operation and take advantage of the parallel processing power of the GPU. Unfo...

متن کامل

'Meshsweeper': Dynamic Point-to-Polygonal-Mesh Distance and Applications

ÐWe introduce a new algorithm for computing the distance from a point to an arbitrary polygonal mesh. Our algorithm uses a multiresolution hierarchy of bounding volumes generated by geometric simplification. Our algorithm is dynamic, exploiting coherence between subsequent queries using a priority process and achieving constant time queries in some cases. It can be applied to meshes that transf...

متن کامل

Optimized GPU evaluation of arbitrary degree NURBS curves and surfaces

This paper presents a new unified and optimized method for evaluating and displaying trimmed NURBS surfaces using the Graphics Processing Unit (GPU). Trimmed NURBS surfaces, the de facto standard in commercial mechanical CAD modeling packages, are currently being tessellated into triangles before being sent to the graphics card for display since there is no native hardware support for NURBS. Ot...

متن کامل

Piecewise Developable Surface Approximation of General NURBS Surfaces, with Global Error Bounds

Developable surfaces possess qualities that are desirable in the manufacturing processes of CAD/CAM models. Specifically, models formed out of developable surfaces can be manufactured from planar sheets of material without distortion. This quality proves most useful when dealing with materials such as paper, leather or sheet metal, which cannot be easily stretched or deformed during production....

متن کامل

Computation of the shortest path between two curves on a parametric surface by geodesic-like method

In this paper, we present the geodesic-like algorithm for the computation of the shortest path between two objects on NURBS surfaces and periodic surfaces. This method can improve the distance problem not only on surfaces but in R. Moreover, the geodesic-like algorithm also provides an efficient approach to simulate the minimal geodesic between two holes on a NURBS surfaces.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Computer-Aided Design

دوره 43  شماره 

صفحات  -

تاریخ انتشار 2011